ON THE NP-HARDNESS OF EDGE-DELETION AND CONTRACTION PROBLEMSWATANABE T; AE T; NAKAMURA A et al.1983; DISCRETE APPLIED MATHEMATICS; ISSN 0166-218X; NLD; DA. 1983; VOL. 6; NO 1; PP. 63-78; BIBL. 18 REF.Article

WHETHER A SET OF MULTIVALUED DEPENDENCIES IMPLIES A JOIN DEPENDENCY IS NP-HARDFISCHER PC; DON MIN TSOU.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 259-266; BIBL. 17 REF.Article

On the complexity of preemptive open-shop scheduling problemsLIU, C. Y; BULFIN, R. L.Operations research letters. 1985, Vol 4, Num 8, pp 71-74, issn 0167-6377Article

COMPLEXITY RESULTS FOR SCHEDULING TASKS IN FIXED INTERVALS ON TWO TYPES OF MACHINESNAKAJIMA K; HAKIMI SL; LENSTRA JK et al.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 512-520; BIBL. 17 REF.Article

THE NP-COMPLETENESS COLUMN: AN ONGOING GUIDEJOHNSON DS.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 1; PP. 89-99; BIBL. 33 REF.Article

THE MINIMUM-LENGTH GENERATOR SEQUENCE PROBLEM IS NP-HARDEVEN S; GOLDREICH O.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 3; PP. 311-313; BIBL. 5 REF.Article

UNE FAMILLE D'HEURISTIQUES ET UNE PROCEDURE "ACCELEREE" D'EXPLORATION POUR UN PROBLEME NP-DUR D'ORDONNANCEMENT SUR DES MACHINES EN PARALLELE = A FAMILY OF HEURISTICS AND AN "ACCELERATED" EXPLORATION PROCEDURE FOR A HARD-NP SCHEDULING PROBLEM ON MACHINES IN PARALLELACHAB RAMDANE.1981; ; FRA; DA. 1981; 187 P.; 21 CM; BIBL. 3 P.; TH. 3E CYCLE: STAT. MATH./PARIS 6/1981Thesis

COMPLEXITY OF DECOMPOSING GRAPHS INTO FACTORS WITH GIVEN DIAMETERS OF RADIIPLESNIK J.1982; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1982; VOL. 32; NO 4; PP. 379-387; BIBL. 32 REF.Article

SCHEDULING TO MAXIMIZE THE MINIMUN PROCESSOR FINISH TIME IN A MULTIPROCESSOR SYSTEMDEVERMEYER BL; FRIESEN DK; LANGSTON MA et al.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 2; PP. 190-196; BIBL. 7 REF.Article

A GOOD SUBMATRIX IS HARD TO FINDBARTHOLDI JJ III.1982; OPERATIONS RESEARCH LETTERS; ISSN 507679; NLD; DA. 1982; VOL. 1; NO 5; PP. 190-193; BIBL. 15 REF.Article

On a dual version of the one-dimensional bin packing problemASSMANN, S. F; JOHNSON, D. S; KLEITMAN, D. J et al.Journal of algorithms (Print). 1984, Vol 5, Num 4, pp 502-525, issn 0196-6774Article

Restricted information from nonadaptive queries to NPHAN, Y; THIERAUF, T.Information and computation (Print). 1996, Vol 128, Num 2, pp 119-125, issn 0890-5401Article

New NP-hard and NP-complete polynomial and integer divisibility problemsPLAISTED, D. A.Theoretical computer science. 1984, Vol 31, Num 1-2, pp 125-138, issn 0304-3975Article

On the complexity of designing optimal partial-match retrieval systemsMORAN, S.ACM transactions on database systems. 1983, Vol 8, Num 4, pp 543-551, issn 0362-5915Article

NP-hard sets are superterse unless NP is smallWANG, Y.Information processing letters. 1997, Vol 61, Num 1, pp 1-6, issn 0020-0190Article

Finding the convex hull facet by facetSWART, G.Journal of algorithms (Print). 1985, Vol 6, Num 1, pp 17-48, issn 0196-6774Article

Optimum placement of guardsNTAFOS, S; TSOUKALAS, M.Information sciences. 1994, Vol 76, Num 1-2, pp 141-150, issn 0020-0255Article

Dynamic storage allocation with limited compaction complexity and some practical implicationsBLAZEWICZ, J; NAWROCKI, J. R.Discrete applied mathematics. 1985, Vol 10, Num 3, pp 241-253, issn 0166-218XArticle

On random hard sets for NPBOOK, R. V; WATANABE, O.Information and computation (Print). 1996, Vol 125, Num 1, pp 70-76, issn 0890-5401Article

PROBABILISTIC ALGORITHMS FOR DECIDING EQUIVALENCE OF STRAIGHT-LINE PROGRAMSIBARRA OH; MORAN S.1983; JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY; ISSN 0004-5411; USA; DA. 1983; VOL. 30; NO 1; PP. 217-228; BIBL. 19 REF.Article

ALGORITHMIC COMPLEXITY: THREE NP-HARD PROBLEMS IN COMPUTATIONAL STATISTICSWELCH WJ.1982; JOURNAL OF STATISTICAL COMPUTATION AND SIMULATION; ISSN 0094-9655; USA; DA. 1982; VOL. 15; NO 1; PP. 17-25; BIBL. 17 REF.Article

ON THE COMPLEXITY OF THE ONE-TERMINAL NETWORK DESIGN PROBLEM = SUR LA COMPLEXITE DU PROBLEME DE CONCEPTION D'UN RESEAU A UN TERMINALMEGIDDO N.1982; OPER. RES. LETT.; ISSN 507679; NLD; DA. 1982; VOL. 1; NO 3; PP. 105-107; BIBL. 3 REF.Article

Complexity of solving linear interval equationsROHN, J.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 271-274, issn 0044-2267, SUP3Conference Paper

Local search, reducibility and approximability of NP-optimization problemsAUSIELLO, G; PROTASI, M.Information processing letters. 1995, Vol 54, Num 2, pp 73-79, issn 0020-0190Article

Several NP-hard problems arising in robust stability analysisNEMIROVSKII, A.MCSS. Mathematics of control, signals and systems. 1993, Vol 6, Num 2, pp 99-105, issn 0932-4194Article